One Variable Equations in Free Groups via Context Free Languages
نویسندگان
چکیده
We use context free languages to analyze solution sets to one variable equations over free groups.
منابع مشابه
Free Vibration Analysis of Micropolar Thermoelastic Cylindrical Curved Plate in Circumferential Direction
The free vibration analysis ofhomogeneous isotropic micropolar thermoelastic cylindrical curved plate in circumferential direction has been investigated in the context of generalized themoelasticity III, recently developed by Green and Naghdi. The model has been simplified using Helmholtz decomposition technique and the resulting equations have been solved using separation of variable method. M...
متن کاملAlgorithmics on SLP-compressed strings: A survey
Results on algorithmic problems on strings that are given in a compressed form via straightline programs are surveyed. A straight-line program is a context-free grammar that generates exactly one string. In this way, exponential compression rates can be achieved. Among others, we study pattern matching for compressed strings, membership problems for compressed strings in various kinds of formal...
متن کاملMildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars
A family of languages is called mildly context-sensitive if – it includes the family of all -free context-free languages; – it contains the languages • {anbncn : n ≥ 1} – multiple agreement, • {ambncmdn : m,n ≥ 1} – crossed dependencies, and • {ww : w ∈ Σ+} – reduplication; – all its languages are semi-linear; and – their membership problem is decidable in polynomial time. In our paper we intro...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملContext - Free Term Sets are Regular - andSome Applications
We prove that all context-free sets of terms are regular tree languages, a natural conjecture formulated in Mat97]. We motivate our interest in this language-theoretic result with two issues. First in automated model building it is desirable to characterize the power of context-free languages to represent single Herbrand models, which we conclude to be exactly the nite models. Second in proposi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003